The “Combining Coefficient” for Anisotropic Sparse Grids

نویسنده

  • John Burkardt
چکیده

The anisotropic sparse grid is a natural extension of the isotropic sparse grid, adapted for situations in which the behavior of the data varies with respect to particular spatial dimensions. An appropriately configured anisotropic sparse grid can achieve accuracy comparable to that of an isotropic sparse grid, while further compounding the reduction in the number of function evaluations that an isotropic sparse grid offers compared to a product rule. To modify an isotropic sparse grid algorithm into an anisotropic one requires changes to the selection criterion and the combining coefficients used in connection with the component product rules. This article discusses these changes and their implementation in a particular computer code.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An anisotropic sparse grid stochastic collocation method for elliptic partial differential equations with random input data

This work proposes and analyzes an anisotropic sparse grid stochastic collocation method for solving elliptic partial differential equations with random coefficients and forcing terms (input data of the model). The method consists of a Galerkin approximation in the space variables and a collocation, in probability space, on sparse tensor product grids utilizing either Clenshaw-Curtis or Gaussia...

متن کامل

Dynamic Smagorinsky model on anisotropic grids

To examine the performance of the dynamic Smagorinsky model in a controlled fashion on anisotropic grids, simulations of forced isotropic turbulence are performed using highly anisotropic discretizations. The resulting model coefficients are compared with an earlier prediction. Two extreme cases are considered: pancake-like grids, for which two directions are poorly resolved compared to the thi...

متن کامل

Adaptive and Local Model Order Reduction with Machine Learning for Parametrized Systems

Computing density estimators with maximum a posteriori and sparse grids Locally adaptive greedy approximations for anisotropic parameter reduced basis spaces

متن کامل

A Multigrid Method for Adaptive Sparse Grids

Sparse grids have become an important tool to reduce the number of degrees of freedom of discretizations of moderately high-dimensional partial differential equations; however, the reduction in degrees of freedom comes at the cost of an almost dense and unconventionally structured system of linear equations. To guarantee overall efficiency of the sparse grid approach, special linear solvers are...

متن کامل

Uncertainty quantification in Discrete Fracture Network models: Stochastic fracture transmissivity

We consider flows in fractured media, described by Discrete Fracture Network (DFN) models. We perform an Uncertainty Quantification analysis, assuming the fractures’ transmissivity coefficients to be random variables. Two probability distributions (log-uniform and log-normal) are used within different laws that express the coefficients in terms of a family of independent stochastic variables; t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012